t=int(input())
for i in range(t):
n= int(input())
s=input()
if n==1:
print(0)
else:
sum=0
l=[]
for i in range(n):
if s[i]=="L":
sum+=i
else:
sum+=n-1-i
pos1=[]
pos2=[]
for i in range(n):
if i<int(n/2):
if s[i]=="L":
pos1.append(i)
elif i==int(n/2) and n%2==1 :
pass
else:
if s[i]=="R":
pos2.append(i)
first=0
last=len(pos2)-1
while first<len(pos1) and last>=0:
if pos1[first]<= n-1-pos2[last]:
sum+= n-1-pos1[first] -pos1[first]
l.append(sum)
first+=1
else:
sum+= pos2[last] - (n-1-pos2[last])
l.append(sum)
last-=1
if first==len(pos1) and last>=0:
while last>=0:
sum+= pos2[last] - (n-1-pos2[last])
l.append(sum)
last-=1
elif last<0 and first<=len(pos1)-1:
while first<=len(pos1)-1:
sum+= n-1-pos1[first]-pos1[first]
l.append(sum)
first+=1
else:
pass
if len(l)==0:
l=[sum]*(n-len(l))
else:
l=l+ [l[len(l)-1]]*(n-len(l))
print(*l)
#include <bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin >> t;
while (t--)
{
long long n;
cin >> n;
string s;
cin >> s;
long long sum = 0;
int count = 0;
for (int i = 0; i < s.size(); i++)
{
if (s[i] == 'L')
{
sum += i;
}
else
sum += (n - i - 1);
}
// cout<<sum<<endl;
vector<long long> v;
for(int i=0;i<s.size()/2;i++)
{
if(s[i]=='L' && i<s.size()/2)
{
sum += abs((n - i - 1) - (i));
v.push_back(sum);
}
if(s[n-i-1]=='R' && (n-i-1)>=s.size()/2)
{
sum += abs(i - (n - i - 1));
v.push_back(sum);
}
// if(i==s.size()/2 && )
}
// for (int i = 0; i < s.size() / 2; i++)
// {
// if (s[i] == 'R')
// {
// // count++;
// }
// else
// {
// sum += (n - i - 1) - (i);
// v.push_back(sum);
// // cout << sum << " ";
// }
// }
// for (int i = s.size() / 2; i < n; i++)
// {
// if (i == s.size() / 2 && n % 2 != 0)
// continue;
// else if (s[i] == 'L')
// {
// // cout << sum << " ";
// }
// else
// {
// sum += i - (n - i - 1);
// v.push_back(sum);
// // cout << sum << " ";
// }
// }
if (v.size() != 0)
{
sort(v.begin(),v.end());
for (int i = 0; i < v.size(); i++)
{
cout << v[i] << " ";
}
for (int i = 0; i < n - v.size(); i++)
{
cout << v[v.size() - 1] << " ";
}
cout << endl;
}
else
{
for(int i=0;i<n;i++)
{
cout<<sum<<" ";
}
cout<<endl;
}
}
return 0;
}165B - Burning Midnight Oil | 17A - Noldbach problem |
1350A - Orac and Factors | 1373A - Donut Shops |
26A - Almost Prime | 1656E - Equal Tree Sums |
1656B - Subtract Operation | 1656A - Good Pairs |
1367A - Short Substrings | 87A - Trains |
664A - Complicated GCD | 1635D - Infinite Set |
1462A - Favorite Sequence | 1445B - Elimination |
1656C - Make Equal With Mod | 567A - Lineland Mail |
1553A - Digits Sum | 1359B - New Theatre Square |
766A - Mahmoud and Longest Uncommon Subsequence | 701B - Cells Not Under Attack |
702A - Maximum Increase | 1656D - K-good |
1426A - Floor Number | 876A - Trip For Meal |
1326B - Maximums | 1635C - Differential Sorting |
961A - Tetris | 1635B - Avoid Local Maximums |
20A - BerOS file system | 1637A - Sorting Parts |